Ramsey numbers of large books
نویسندگان
چکیده
A book B n ${B}_{n}$ is a graph which consists of $n$ triangles sharing common edge. In 1978, Rousseau and Sheehan conjectured that the Ramsey number satisfies r ( m , ) ≤ 2 + c $r({B}_{m},{B}_{n})\le \,2(m+n)+c$ for some constant > 0 $c\gt 0$ . this article, we obtain o 2(m+n)+o(n)$ all $m\le n$ large, confirms conjecture asymptotically. As corollary, our result implies related Faudree, on strongly regular holds
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملA note on Ramsey numbers for books
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn) = 2n + 3 for all n ≥ cm.
متن کاملthe ramsey numbers of large trees versus wheels
for two given graphs g1 and g2, the ramseynumber r(g1,g2) is the smallest integer n such that for anygraph g of order n, either $g$ contains g1 or the complementof g contains g2. let tn denote a tree of order n andwm a wheel of order m+1. to the best of our knowledge, only r(tn,wm) with small wheels are known.in this paper, we show that r(tn,wm)=3n-2 for odd m with n>756m^{10}.
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملRamsey numbers involving graphs with large degrees
Let F be a graph of order v(F) ≥ 3 and size e(F), and let ρ(F) = (e(F) − 1)/(v(F) − 2). It is shown that if Gn is a graph of order n with average degree dn ≥ 2, then r(F ,Gn) ≥ c ( dn log dn )ρ(F) for all n, where c = c(F) > 0 is a constant. © 2009 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22815